package il.ac.bgu.cs.heuristics.utils;

/**
 * 
 * A simple pairing object
 * 
 * @author Ronen Pinko
 * 
 * @param <T>
 */
public class Pair<T> { // NOPMD generated equals code

	private final T	first;
	private final T	second;

	public Pair(T first, T second) {
		this.first = first;
		this.second = second;
	}

	public T getFirst() {
		return first;
	}

	public T getSecond() {
		return second;
	}

	@Override
	public int hashCode() {
		final int prime = 31;
		int result = 1;
		result = prime * result + ((first == null) ? 0 : first.hashCode());
		result = prime * result + ((second == null) ? 0 : second.hashCode());
		return result;
	}

	@Override
	public boolean equals(Object obj) { // NOPMD generated code
		if (this == obj) {
			return true;
		}
		if (obj == null) {
			return false;
		}
		if (getClass() != obj.getClass()) {
			return false;
		}
		// we don't care about type here, polymorphism kicks in
		@SuppressWarnings("unchecked")
		final Pair other = (Pair) obj; // NOPMD generated code
		if (first == null) {
			if (other.first != null) {
				return false;
			}
		} else if (!first.equals(other.first)) {
			return false;
		}
		if (second == null) {
			if (other.second != null) {
				return false;
			}
		} else if (!second.equals(other.second)) {
			return false;
		}
		return true;
	}

	@Override
	public String toString() {
		return first.toString() + " - " + second.toString();
	}

}
